On modelling mobility

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On modelling mobility

We present a model of distributed computation which is based on a fragment of the-calculus relying on asynchronous point-to-point communication. We enrich the model with the following features: the explicit distribution of processes to locations , the routing of messages, the mobility of processes, and the failure of locations and their detection. Our contributions are two folds. At the speciic...

متن کامل

On Modelling Agent Mobility in Multiagent Methodologies

1. PROBLEM STATEMENT – METHODOLOGICAL SUPPORT FOR SYSTEMS WITH AGENT MOBILITY? A property of agents is the ability to move from one host to another to perform computations. While not all agents require such a property, agent mobility has been recognized as beneficial in a number of applications and a sizable number of mobile agent toolkits have been developed for mobile multiagent applications....

متن کامل

Agenda driven mobility modelling

Mobility modelling is an essential component of wireless and mobile networking research. Our proposed Agenda Driven Mobility Model takes into consideration a person’s social activities in the form of agenda (when, where and what) for motion generation. The model provides a framework for translating social agendas into a mobile world. Using the data from National Household Travel Survey (NHTS) o...

متن کامل

Modelling Correlated Mobility

When nodes in a mobile network cluster together or move according to common external factors (e.g., cars that follow the road network), the resulting contact patterns become correlated. In this work we address the question of modelling such correlated mobility movements for the analysis of intermittently connected networks. We propose to use the concept of node colouring time to characterise dy...

متن کامل

Modelling IP Mobility

ing away the details of message delivery across the network. The communication mechanism we assume is an asynchronous one, involving unbounded bu ers and allowing message overtaking. We assume a collection of names de ned as the union of pairwise disjoint sets RN [ AN [ LAN [DN [ CN , where: ri 2 RN Router Names ai 2 AN Agent Names li 2 LAN Local Agent Addresses di 2 DN Data Items c 2 CN Contro...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Theoretical Computer Science

سال: 2000

ISSN: 0304-3975

DOI: 10.1016/s0304-3975(99)00230-3